package algorithm;

public class leetcode_0714 {
    public int maxProfit(int[] prices, int fee) {
        int len=prices.length;
        int [][] dp=new int[len][2];
        dp[0][0]=0;
        dp[0][1]=-1*prices[0];
        for(int i=1;i<len;++i){
            dp[i][0]=max(dp[i-1][0],dp[i-1][1]+prices[i]-fee);
            dp[i][1]=max(dp[i-1][1],dp[i-1][0]-prices[i]);
        }
        return (dp[len-1][0]>dp[len-1][1])?dp[len-1][0]:dp[len-1][1];
    }
    public int max(int a,int b){
        return (a>b)?a:b;
    }
}
